Factoring in Embedding Dimension Three Numerical Semigroups

نویسندگان

  • F. Aguiló
  • Pedro A. García-Sánchez
چکیده

Let us consider a 3-numerical semigroup S = 〈a, b,N 〉. Given m ∈ S, the triple (x, y, z) ∈ N3 is a factorization of m in S if xa+ yb+ zN = m. This work is focused on finding the full set of factorizations of any m ∈ S and as an application we compute the catenary degree of S. To this end, we relate a 2D tessellation to S and we use it as a main tool.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Numerical Semigroups with Embedding Dimension Three

Let f ̸= 1, 3 be a positive integer. We prove that there exists a numerical semigroup S with embedding dimension three such that f is the Frobenius number of S. We also show that the same fact holds for affine semigroups in higher dimensional monoids.

متن کامل

Numerical semigroups with maximal embedding dimension

Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...

متن کامل

The Frobenius problem for numerical semigroups

In this paper, we characterize those numerical semigroups containing 〈n1, n2〉. From this characterization, we give formulas for the genus and the Frobenius number of a numerical semigroup. These results can be used to give a method for computing the genus and the Frobenius number of a numerical semigroup with embedding dimension three in terms of its minimal system of generators.

متن کامل

An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup

We give an algorithm to compute the set of primitive elements for an embedding dimension three numerical semigroups. We show how we use this procedure in the study of the construction of L-shapes and the tame degree of the semigroup.

متن کامل

Numerical Semigroups with a Monotonic Apéry Set

We study numerical semigroups S with the property that ifm is the multiplicity of S and w(i) is the least element of S congruent with i modulo m, then 0 < w(1) < . . . < w(m − 1). The set of numerical semigroups with this property and fixed multiplicity is bijective with an affine semigroup and consequently it can be described by a finite set of parameters. Invariants like the gender, type, emb...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2010